全文获取类型
收费全文 | 191篇 |
免费 | 102篇 |
国内免费 | 8篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 3篇 |
2020年 | 13篇 |
2019年 | 4篇 |
2018年 | 8篇 |
2017年 | 8篇 |
2016年 | 18篇 |
2015年 | 11篇 |
2014年 | 20篇 |
2013年 | 11篇 |
2012年 | 11篇 |
2011年 | 16篇 |
2010年 | 8篇 |
2009年 | 12篇 |
2008年 | 14篇 |
2007年 | 11篇 |
2006年 | 25篇 |
2005年 | 19篇 |
2004年 | 11篇 |
2003年 | 12篇 |
2002年 | 10篇 |
2001年 | 11篇 |
2000年 | 8篇 |
1999年 | 5篇 |
1998年 | 7篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1989年 | 1篇 |
排序方式: 共有301条查询结果,搜索用时 15 毫秒
61.
We study the environmental regulation of industrial activities that are organized as projects. Applications arise in construction, ship and aircraft building, and film making, among other industries. Relative to manufacturing, environmental regulation is different in project‐based industries, due to the uniqueness and geographical diversity of projects, and a lack of product takeback programs. Because the amount of waste and pollution generated by project companies can be large, regulators need environmental policies to ensure reduction of waste and pollution. We consider a regulator who attempts to maximize social welfare. We model this problem as a bilevel nonlinear program. The upper level regulator specifies waste reduction targets, which the lower level project companies meet using waste stream reduction and remediation of pollution, while attempting to control their project costs. We find that high waste diversion targets lead to outcomes with little pollution, but excessive project costs and only modest waste stream reduction. Projects that have lower task precedence density, or that have pollutants with different environmental impacts, show larger increases in project cost and time resulting from regulation. We describe a subsidy for waste stream reduction that coordinates the system, and we estimate the value of coordination. We also describe a bonus that encourages truthful reporting by project companies, and evaluate the relative cost and effectiveness of the subsidy and the bonus. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 228–247, 2015 相似文献
62.
63.
64.
复杂非线性隔冲减振系统计算分析 总被引:1,自引:0,他引:1
基于结构动力学理论,提出了一种用于分析计算复杂非线性隔冲减振系统的双模型两步计算法。该方法将冲击振动分成2个阶段:冲击作用阶段和自由振动阶段。冲击作用阶段,采用两自由度模型进行响应计算,该两自由度模型可有效地解决基础冲击输入问题;自由振动阶段,采用单自由度模型进行响应计算,设备在该阶段以冲击终了时刻的速度和位移为初始条件进行振动。文中还对一个典型的复杂非线性系统的冲击过程进行了数值计算.该方法亦可用于线性隔冲减振系统的计算分析. 相似文献
65.
通过二维实映射研究了非线性Kronig-Penney超晶格中波的传播。数值计算得到非线性系数不同、以及透射波幅不同时的映射图。结果表明,非线性系数对波传播有明显的调制作用,而透射波幅对非线性系数的有效性有明显的改变。 相似文献
66.
This paper discusses a novel application of mathematical programming techniques to a regression problem. While least squares regression techniques have been used for a long time, it is known that their robustness properties are not desirable. Specifically, the estimators are known to be too sensitive to data contamination. In this paper we examine regressions based on Least‐sum of Absolute Deviations (LAD) and show that the robustness of the estimator can be improved significantly through a judicious choice of weights. The problem of finding optimum weights is formulated as a nonlinear mixed integer program, which is too difficult to solve exactly in general. We demonstrate that our problem is equivalent to a mathematical program with a single functional constraint resembling the knapsack problem and then solve it for a special case. We then generalize this solution to general regression designs. Furthermore, we provide an efficient algorithm to solve the general nonlinear, mixed integer programming problem when the number of predictors is small. We show the efficacy of the weighted LAD estimator using numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
67.
68.
Unscented卡尔曼滤波(UKF)通过构造一组,具有与给定状态估计相同的一、二阶矩,也可能是高阶矩的样本点,实现对非线性系统的状态估计,因此其计算效率取决于能够捕获这些数字特征的样本点数目.通过构造n 2个样本点来捕获n维状态变量的均值和方差,提出了将这种方法应用于惯性导航的初始对准.仿真结果表明在同等滤波精度的情况下,该方法比UKF计算效率更高,实时性更好. 相似文献
69.
In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
70.
We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n5/ε4) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献